#include <bits/stdc++.h>

using namespace std;
const int maxn=1001;
int main_1048()
{
    int hash_table[maxn]={0};
    int N,M,coin;
    scanf("%d %d",&N,&M);
    for (int i=0;i<N ;++i )
    {
        scanf("%d",&coin);
        ++hash_table[coin];
    }
    bool isExist=false;
    for (int i=0;i<M ;++i )
    {
        if (hash_table[i]>0&&hash_table[M-i]>0)
        {
            if (i==M-i&&hash_table[i]==1)
            {
                continue;
            }
            isExist=true;
            printf("%d %d",i,M-i);
            break;
        }
    }
    if (!isExist)
    {
        printf("No Solution");
    }
	return 0;
}
